Efficient processing of top-k spatial Boolean queries for distributed system
نویسنده
چکیده
The widened use of spatial data imposes the heavy load on databases and data sizes. Now a day’s spatial data is a part of smart computing because location is mostly responsible for user activities. In this paper we focus on reviewing a more efficient system to process spatial data in distributed system by implementing a combined approach for geospatial indexing and query formatting. Previous research suggests a positive improvement in efficiency of system through a new approach. A review of techniques for indexing and query processing is presented in this paper. Keywords—Spatial data; GeoHash; GeoSpatial indexing; Boolean Query;
منابع مشابه
Efficient Processing of Preference Queries in Distributed and Spatial Databases
Traditional SQL queries are recognized for producing an exact and complete result set. However, for an increasing number of applications that manage massive amounts of data, the large result set produced by traditional SQL queries has become difficult to handle. Therefore, there is an increasing interest in queries that produce a more concise result set. Preference queries capture the wishes of...
متن کاملSOPS: A System for Efficient Processing of Spatial-Keyword Publish/Subscribe
Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale. These geo-textual data cover a wide range of topics. Users are interested in receiving up-to-date geo-textual objects (e.g., geo-tagged Tweets) such that their locations meet users’ need and their texts are interesting to users. For example, a user may want to be update...
متن کاملEfficient Reverse Top-k Boolean Spatial Keyword Queries on Road Networks
Reverse k nearest neighbor (RkNN) queries have a broad application base such as decision support, profile-based marketing, and resource allocation. Previous work on RkNN search does not take textual information into consideration or limits to the Euclidean space. In the real world, however, most spatial objects are associated with textual information and lie on road networks. In this paper, we ...
متن کاملEfficient and Scalable Method for Processing Top-k Spatial Boolean Queries
In this paper, we present a novel method to efficiently process top-k spatial queries with conjunctive Boolean constraints on textual content. Our method combines an R-tree with an inverted index by the inclusion of spatial references in posting lists. The result is a diskresident, dual-index data structure that is used to proactively prune the search space. R-Tree nodes are visited in best-fir...
متن کاملTop-k Spatial Preference Queries in Directed Road Networks
Top-k spatial preference queries rank objects based on the score of feature objects in their spatial neighborhood. Top-k preference queries are crucial for a wide range of location based services such as hotel browsing and apartment searching. In recent years, a lot of research has been conducted on processing of top-k spatial preference queries in Euclidean space. While few algorithms study to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016